Path Planning Methods in Chemical Engineering
نویسندگان
چکیده
منابع مشابه
Parallel Extrapolation Methods and their Application in Chemical Engineering
We study the parallelization of linearly{implicit extrapolation methods for the solution of large scale systems of diierential algebraic equations arising in a method of lines (MOL) treatment of partial diierential equations. In our approach we combine a slightly overlapping domain decomposition together with a polynomial block Neumann preconditioner. Through the explicit computation of the mat...
متن کاملImproving Sampling-Based Path Planning Methods with Fast Marching
Sampling-based path planning algorithms are well-known because they are able to find a path in a very short period of time, even in high-dimensional spaces. However, they are non-smooth, random paths far away from the optimum. In this paper we introduce a novel improving technique based on the Fast Marching Method which improves in a deterministic, non-iterative way the initial path provided by...
متن کاملExact and heuristic path planning methods for a virtual environment
Path planning belongs to the best-known and well explored problems in computer science. However, in today’s real-time and dynamic applications, such as virtual reality, existing algorithms for static environment are considerably insufficient and, surprisingly, almost no attention is given to techniques for dynamic graphs. This paper introduces two methods to plan a path in an undirected graph w...
متن کاملOntology-based methods for enhancing autonomous vehicle path planning
We report the results of a first implementation demonstrating the use of an ontology to support reasoning about obstacles to improve the capabilities and performance of on-board route planning for autonomous vehicles. This is part of an overall effort to evaluate the performance of ontologies in different components of an autonomous vehicle within the 4D/RCS system architecture developed at NIS...
متن کاملPath planning in games
Path planning is one of the fundamental problems in games. The path planning problem can be defined as finding a collision-free path, traversed by a unit, between a start and goal position in an environment with obstacles. The variant we study is the problem of finding paths for one or more groups of units, such as soldiers or tanks in a real-time strategy game, all traversing the same (static)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Environment. Technology. Resources. Proceedings of the International Scientific and Practical Conference
سال: 2015
ISSN: 1691-5402,1691-5402
DOI: 10.17770/etr2015vol3.188